Graph isomorphism

Results: 110



#Item
91[removed]The Invariant Problem for Binary

[removed]The Invariant Problem for Binary

Add to Reading List

Source URL: www.haverford.edu

Language: English - Date: 2013-09-04 15:47:39
92Planar Graph Growth Constants Steven Finch August 25, 2004 A graph of order n consists of a set of n vertices (points) together with a set of edges (unordered pairs of distinct points). Note that loops and multiple paral

Planar Graph Growth Constants Steven Finch August 25, 2004 A graph of order n consists of a set of n vertices (points) together with a set of edges (unordered pairs of distinct points). Note that loops and multiple paral

Add to Reading List

Source URL: www.people.fas.harvard.edu

Language: English - Date: 2006-04-26 14:46:20
93The accepted wisdom is that standard techniques from classical model theory fail to apply in the finite. We attempt to dispel this notion by presenting new proofs of the Gaifman and Hanf locality theorems. In particular,

The accepted wisdom is that standard techniques from classical model theory fail to apply in the finite. We attempt to dispel this notion by presenting new proofs of the Gaifman and Hanf locality theorems. In particular,

Add to Reading List

Source URL: www.haverford.edu

Language: English - Date: 2012-04-01 12:19:11
94Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks

Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks

Add to Reading List

Source URL: www.ncbi.nlm.nih.gov

Language: English
95Finite Model Theory and Graph Isomorphism. I. Anuj Dawar

Finite Model Theory and Graph Isomorphism. I. Anuj Dawar

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2013-12-16 05:15:33
96Automorphism groups, isomorphism, reconstruction (Chapter 27 of the Handbook of Combinatorics) L´aszl´o Babai∗

Automorphism groups, isomorphism, reconstruction (Chapter 27 of the Handbook of Combinatorics) L´aszl´o Babai∗

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2012-04-21 16:22:42
974. MODELLING THE GRAPH SYSTEMS A system of graphs is such complex or a set of graphs, where the relationships between elements are fixed. As rule, graphs are systematized on the basis of such characteristics as planarity,

4. MODELLING THE GRAPH SYSTEMS A system of graphs is such complex or a set of graphs, where the relationships between elements are fixed. As rule, graphs are systematized on the basis of such characteristics as planarity,

Add to Reading List

Source URL: www.graphs.ee

Language: English - Date: 2012-06-18 09:49:55
98PROCEEDINGS OF THE STRUCTURE SEMIOTICS RESEARCH GROUP S.E.R.R. EUROUNIVERSITY TALLINN[removed]THE GRAPH ISOMORPHISM ALGORITHM

PROCEEDINGS OF THE STRUCTURE SEMIOTICS RESEARCH GROUP S.E.R.R. EUROUNIVERSITY TALLINN[removed]THE GRAPH ISOMORPHISM ALGORITHM

Add to Reading List

Source URL: www.dharwadker.org

Language: English - Date: 2009-10-11 13:10:42
99SEMIOTIC MODELLING OF THE GRAPHS John-Tagore Tevet Abstract: Semiotic Modelling of the Graphs (called also Semiotics of the Structure) is a domain of

SEMIOTIC MODELLING OF THE GRAPHS John-Tagore Tevet Abstract: Semiotic Modelling of the Graphs (called also Semiotics of the Structure) is a domain of

Add to Reading List

Source URL: www.graphs.ee

Language: English - Date: 2011-08-10 08:41:56
100Morphisms of Rings and Applications to Complexity

Morphisms of Rings and Applications to Complexity

Add to Reading List

Source URL: www.math.uni-bonn.de

Language: English - Date: 2006-08-07 13:36:32